#include <iostream>
#include <cstring>

using namespace std; 

const int N = 110, M = 1e4 + 10;
int a[M];
int f[N][N];

int n, m;

int main()
{
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= m; i++) cin >> a[i];
	memset(f, 0x3f, sizeof f);
	for(int i = 1; i <= n; i++) f[i][i] = 0;
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= n; j++)
			scanf("%d", &f[i][j]);
	for(int k = 1; k <= n; k++)
		for(int i = 1; i <= n; i++)
			for(int j = 1; j <= n; j++)
				f[i][j] = min(f[i][j], f[i][k] + f[k][j]);
	int ans = 0;
	for(int i = 1; i < m; i++) ans += f[a[i]][a[i + 1]];
	cout << ans << endl;
	return 0; 
}
